//
// Created by Jisam on 14/09/2024 7:18 PM.
// Solution of  背单词
//#pragma GCC optimize(3)
#include <bits/stdc++.h>

using namespace std;
#define coutn(x) cout << (x) << "\n"
#define endl "\n"
#define PSI pair<string,int>
#define PII pair<int,int>
#define PDI pair<double,int>
#define PDD pair<double,double>
#define VVI vector<vector<int>>
#define VI vector<int>
#define VS vector<string>
#define PQLI priority_queue<int, vector<int>, less<int>>
#define PQGI priority_queue<int, vector<int>, greater<int>>
#define code_by_jisam ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
typedef long long i64;
typedef unsigned u32;
typedef unsigned long long u64;
typedef __int128 i128;
int dx[] = {-1, 1, 0, 0, 1, 1, -1, -1,};
int dy[] = {0, 0, -1, 1, 1, -1, -1, 1,};

void solution() {
    int n;
    cin >> n;
    vector<string> ss(n);
    for (int i = 0; i < n; i++) {
        cin >> ss[i];
        ss[i] = ' ' + ss[i] + ' ';
    }
    string a;
    cin >> a;
    i64 cnt = 0;
    for (int i = 0; i < n; i++) {
        if (ss[i].find(a) == 1) {
            cnt ++;
        }
    }
    coutn(cnt);
}

int main() {
    code_by_jisam;
    i64 T = 1;
//    cin >> T;
    while (T--) {
        solution();
    }
    return 0;
}